Large-scale Vietnamese point-of-interest classification using weak labeling

Point-of-Interests (POIs) represent geographic location by different categories (e.g., touristic places, amenities, or shops) and play a prominent role in several location-based applications. However, the majority of POIs category labels are crowd-sourced by the community, thus often of low quality. In this paper, we introduce the first annotated dataset for the POIs categorical classification task in Vietnamese. A total of 750,000 POIs are collected from WeMap, a Vietnamese digital map. Large-scale hand-labeling is inherently time-consuming and labor-intensive, thus we have proposed a new approach using weak labeling. As a result, our dataset covers 15 categories with 275,000 weak-labeled POIs for training, and 30,000 gold-standard POIs for testing, making it the largest compared to the existing Vietnamese POIs dataset. We empirically conduct POI categorical classification experiments using a strong baseline (BERT-based fine-tuning) on our dataset and find that our approach shows high efficiency and is applicable on a large scale. The proposed baseline gives an F1 score of 90% on the test dataset, and significantly improves the accuracy of WeMap POI data by a margin of 37% (from 56 to 93%)

Biocontrol of Alternaria alternata YZU, a causal of stem end rot disease on pitaya, with soil phosphate solubilizing bacteria

Stem end rot is the most destructive disease caused by Alternaria alternata YZU in pitaya-growing regions of Vietnam. This study was conducted to characterize antagonistic phosphate-solubilizing bacteria (PSB) from rhizosphere soil for their biocontrol activities against A. alternata YZU and evaluate the effect of temperature, pH, and water activity on that antagonism. Among seven PSB isolated from 45 rhizosphere soil samples, PSB31 (identified as Bacillus sp. strain IMAU61039, Accession number: MF803700.1) exhibited the highest antagonistic activity against A. alternata YZU with an average inhibition diameter of 0.65 ± 0.05 cm. The results also show that the strain PSB31 controlled the mycelial growth of A. alternata YZU by secreting antifungal metabolites. The most potent inhibitory activity was identified under in vitro conditions of 25 °C, pH 7, and aw 1. The isolated PSB31 could be a potential biological control agent against A. alternata YZU

Weighted Scheduling of Time-Sensitive Coflows

Datacenter networks commonly facilitate the transmission of data in distributed computing frameworks through coflows, which are collections of parallel flows associated with a common task. Most of the existing research has concentrated on scheduling coflows to minimize the time required for their completion, i.e., to optimize the average dispatch rate of coflows in the network fabric. Nevertheless, modern applications often produce coflows that are specifically intended for online services and mission-crucial computational tasks, necessitating adherence to specific deadlines for their completion. In this paper, we introduce \wdcoflow,~ a new algorithm to maximize the weighted number of coflows that complete before their deadline. By combining a dynamic programming algorithm along with parallel inequalities, our heuristic solution performs at once coflow admission control and coflow prioritization, imposing a $\sigma$-order on the set of coflows. With extensive simulation, we demonstrate the effectiveness of our algorithm in improving up to $3\times$ more coflows that meet their deadline in comparison the best SoA solution, namely $\mathtt{CS\text{-}MHA}$. Furthermore, when weights are used to differentiate coflow classes, \wdcoflow~ is able to improve the admission per class up to $4\times$, while increasing the average weighted coflow admission rate.Comment: Submitted to IEEE Transactions on Cloud Computing. Parts of this work have been presented at IFIP Networking 202

Performance of DASH over Multipath TCP

Recently, dynamic adaptive streaming over HTTP (DASH) is a dominated traffic in Internet. The client requests a suitable representation depending on the current network condition. On the other hand, multipath transmission control protocols emerges as potential data transmission utilizing multiple network paths concurrently. In this paper, we conduct extensively experiments to evaluate the performance of DASH over MPTCP. Four different performance metrics are investigated, i.e., time on high quality, impactful switches, switch frequency, and average bitrate. The results show that the performance of DASH decreases when the paths of MPTCP have different bandwidths

Contrôle et optimisation des réseaux virtuels sans fil

Network slicing is a key enabler for 5G networks. With network slicing, Mobile Network Operators (MNO) create various slices for Service Providers (SP) to accommodate customized services. As network slices are operated on a common network infrastructure owned by some Infrastructure Provider (InP), efficiently sharing the resources across various slices is very important. In this thesis, taking the InP perspective, we propose several methods for provisioning resources for network slices. Previous best-effort approaches deploy the various Service Function Chains (SFCs) of a given slice sequentially in the infrastructure network. In this thesis, we provision aggregate resources to accommodate slice demands. Once provisioning is successful, the SFCs of the slice are ensured to get enough resources to be properly operated. This facilitates the satisfaction of the slice quality of service requirements. The proposed provisioning solutions also yield a reduction of the computational resources needed to deploy the SFCs.Le découpage du réseau est une technologie clé des réseaux 5G, grâce à laquelle les opérateurs de réseaux mobiles peuvent créer des tranches de réseau indépendantes. Chaque tranche permet à des fournisseurs d'offrir des services personnalisés. Comme les tranches sont opérées sur une infrastructure de réseau commune gérée par un fournisseur d'infrastructure, il est essentiel de développer des méthodes de partage efficace des ressources. Cette thèse adopte le point de vue du fournisseur d'infrastructure et propose plusieurs méthodes de réservation de ressources pour les tranches de réseau. Actuellement, les chaines de fonctions appartenant à une tranche sont déployées séquentiellement sur l'infrastructure, sans avoir de garantie quant à la disponibilité des ressources. Afin d'aller au-delà de cette approche, nous considérons dans cette thèse des approches de réservation des ressources pour les tranches en considérant les besoins agrégés des chaines de fonctions avant le déploiement effectif des chaines de fonctions. Lorsque la réservation a abouti, les chaines de fonctions ont l'assurance de disposer de suffisamment de ressources lors de leur déploiement et de leur mise en service afin de satisfaire les exigences de qualité de service de la tranche. La réservation de ressources permet également d'accélérer la phase d'allocation de ressources des chaines de fonctions

Uncertainty-Aware Resource Provisioning for Network Slicing

International audienceNetwork slicing allows Mobile Network Operators to split the physical infrastructure into isolated virtual networks (slices), managed by Service Providers to accommodate customized services. The Service Function Chains (SFCs) belonging to a slice are usually deployed on a best-effort premise: nothing guarantees that network infrastructure resources will be sufficient to support a varying number of users, each with uncertain requirements. Taking the perspective of a network Infrastructure Provider (InP), this paper proposes a resource provisioning approach for slices, robust to a partly unknown number of users with random usage of the slice resources. The provisioning scheme aims to maximize the total earnings of the InP, while providing a probabilistic guarantee that the amount of provisioned network resources will meet the slice requirements. Moreover, the proposed provisioning approach is performed so as to limit its impact on low-priority background services, which may co-exist with slices in the infrastructure network. Taking all these constraints into account leads to an integer programming problem with many nonlinear constraints. These constraints are first relaxed to get an integer linear programming formulation of the slice resource provisioning problem. This problem is then solved considering the slice resource provisioning demands jointly. A suboptimal approach is finally proposed where slice resource provisioning demands are considered sequentially. Both solutions are compared to provisioning schemes that do not account for best-effort services sharing the common infrastructure network, as well as uncertainties in the slice resource demands

Foresighted Resource Provisioning for Network Slicing

International audienceNetwork slicing has emerged as a pivotal concept in 5G systems, allowing mobile operators to build isolated logical networks (slices) on top of shared infrastructure networks. Within a network slice, several Service Function Chains are usually deployed on a best-effort premise. Nevertheless, this approach does not guarantee the availability of enough infrastructure resources to accommodate the uncertain and timevarying slice resource demands. This paper investigates two adaptive slice resource provisioning methods accounting for the evolution with time of the slice resource demands. A probabilistic guarantee of meeting the slice resource requirements can be obtained, while being robust against uncertainties. The myopic approach accounts for the past demands when provisioning the current demands, while the foresighted approach accounts for both past and future demands. These two methods lead to MILP problems. Their performance is compared with a quasi-static method, where provisioning is agnostic of the past and future demands. Index Terms-Network slicing, foresighted provisioning

Admission Control and Resource Reservation for Prioritized Slice Requests with Guaranteed SLA under Uncertainties

International audienceNetwork slicing has emerged as a key concept in 5G systems, allowing Mobile Network Operators (MNOs) to build isolated logical networks (slices) on top of shared infrastructure networks managed by Infrastructure Providers (InP). Network slicing requires the assignment of infrastructure network resources to virtual network components at slice activation time and the adjustment of resources for slices under operation. Performing these operations just-in-time, on a besteffort basis, comes with no guarantee on the availability of enough infrastructure resources to meet slice requirements. This paper proposes a prioritized admission control mechanism for concurrent slices based on an infrastructure resource reservation approach. The reservation accounts for the dynamic nature of slice requests while being robust to uncertainties in slice resource demands. Adopting the perspective of an InP, reservation schemes are proposed that maximize the number of slices for which infrastructure resources can be granted while minimizing the costs charged to the MNOs. This requires the solution of a max-min optimization problem with a nonlinear cost function and non-linear constraints induced by the robustness to uncertainties of demands and the limitation of the impact of reservation on background services. The cost and the constraints are linearized and several reduced-complexity strategies are proposed to solve the slice admission control and resource reservation problem. Simulations show that the proportion of admitted slices of different priority levels can be adjusted by a differentiated selection of the delay between the reception and the processing instants of a slice resource request